Nullspace embeddings for outerplanar graphs

نویسنده

  • László Lovász
چکیده

We study relations between geometric embeddings of graphs and the spectrum of associated matrices, focusing on outerplanar embeddings of graphs. For a simple connected graph G = (V,E), we define a 1 The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement n 227701. 2 The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP7/2007-2013) / ERC grant agreement n 339109.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding K-outerplanar Graphs into 1 *

We show that the shortest-path metric of any k-outerplanar graph, for any fixed k, can be approximated by a probability distribution over tree metrics with constant distortion and hence also embedded into 1 with constant distortion. These graphs play a central role in polynomial time approximation schemes for many NP-hard optimization problems on general planar graphs and include the family of ...

متن کامل

On in nite generalized outerplanar graphs

Sedll a cek in 6] deened the generalized outerplanar graphs like the nite graphs which can be embedded in the plane in such a way that at least one end-vertex of each edge lies on the boundary of the same face, and he gave a characterization of them by forbidden subgraphs. In this paper, we study innnite graphs with locally nite generalized outerplane embeddings, given a characterization by for...

متن کامل

Generation of Symmetric and Asymmetric Biconnected Rooted Outerplanar Graphs

In a rooted graph, a vertex is designated as its root. An outerplanar graph is represented by a plane embedding such that all vertices appear along its outer boundary. Two different plane embeddings of a rooted outerplanar graphs are called symmetric copies. Given integers n ≥ 3 and g ≥ 3, we give an O(n)-space and O(1)-time delay algorithm that enumerates all biconnected rooted outerplanar gra...

متن کامل

A note on simultaneous embedding of planar graphs

Let G1 and G2 be a pair of planar graphs such that V (G1) = V (G2) = V . A simultaneous embedding [6] Ψ = (Γ1,Γ2) of G1 and G2 is a pair of crossing-free drawings Γ1 and Γ2 of G1 and G2, respectively, such that for every vertex v ∈ V we have Γ1(v) = Γ2(v). If every edge e ∈ E(G1) ∩ E(G2) is represented with the same simple open Jordan curve both in Γ1 and in Γ2 we say that Ψ is a simultaneous e...

متن کامل

Simultaneous Graph Embedding with Bends and Circular Arcs

We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial embeddings for curvilinear simultaneous embeddings of a path and an outerplanar graph. We also show how to use star-shaped levels to find 2-bends per path edge simultaneous embeddings of a path and an outerplanar graph. All embed...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016